
//BC45 小乐乐改数字
import java.util.*;
import java.io.*;
import java.util.StringTokenizer;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        if(n==0){
            System.out.println(0);
            return;
        }
        String s = String.valueOf(n);

        Stack<Character> stack = new Stack<>();
        StringBuffer ans = new StringBuffer();
        for(int i=s.length()-1;i>=0;i--){
            int tmp = s.charAt(i)-'0';
            if(tmp%2==1){
                stack.add('1');
            }else if(tmp%2==0){
                stack.add('0');
            }
        }
        while(stack.size()!=1&&stack.peek()=='0'){
            stack.pop();
        }
        while(!stack.isEmpty()){
            ans.append(stack.pop());
        }
        System.out.println(Integer.parseInt(ans.toString()));
    }
}



//十字爆破
 class Main2 {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw = new PrintWriter(System.out);

        StringTokenizer st = new StringTokenizer(br.readLine());
        int n = Integer.parseInt(st.nextToken()), m = Integer.parseInt(st.nextToken());

        long[][] matrix = new long[n][m];
        long[] row = new long[n];
        long[] col = new long[m];

        // 1. 读取输入并计算行列和
        for (int i = 0; i < n; i++) {
            st = new StringTokenizer(br.readLine());
            for (int j = 0; j < m; j++) {
                matrix[i][j] = Integer.parseInt(st.nextToken());
                row[i] += matrix[i][j];
                col[j] += matrix[i][j];
            }
        }

        // 2. 使用 StringBuilder 构建输出，减少 IO 开销
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                sb.append(row[i] + col[j] - matrix[i][j]).append(" ");
            }
            sb.append("\n");
        }

        // 3. 一次性输出结果，减少 PrintWriter 的调用次数
        pw.print(sb);
        pw.flush();
        pw.close();
        br.close();
    }
}



//比那名居的桃子
 class Main3 {
    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(reader.readLine());
        int n = Integer.parseInt(st.nextToken());
        int k = Integer.parseInt(st.nextToken());

        long[] a = new long[n + 1];
        long[] b = new long[n + 1];

        st = new StringTokenizer(reader.readLine());
        for (int i = 1; i <= n; i++) {
            a[i] = Long.parseLong(st.nextToken());
        }

        st = new StringTokenizer(reader.readLine());
        for (int i = 1; i <= n; i++) {
            b[i] = Long.parseLong(st.nextToken());
        }

        int left = 1, right = 1, begin = 1;
        long hSum = 0, sSum = 0, hMax = 0, sMin = 0;

        while (right <= n) {
            hSum += a[right];
            sSum += b[right];

            while (right - left + 1 > k) {
                hSum -= a[left];
                sSum -= b[left];
                left++;
            }

            if (right - left + 1 == k) {
                if (hSum > hMax || (hSum == hMax && sSum < sMin)) {
                    hMax = hSum;
                    sMin = sSum;
                    begin = left;
                }
            }

            right++;
        }

        System.out.println(begin);
    }
}

